Delay tolerant (delto) distributed TAST codes for cooperative wireless networks

In a distributed cooperative communication system, as the distances between different relay nodes and the receiving nodes may be different, so the performances of distributed space time codes at receiving nodes may badly be degraded if timing synchronization is not assured. In this article, extending the work of Damen et al. we introduce the design of distributed threaded algebraic space-time (TAST) codes offering resistance to timing delay off-set. We present some new and useful techniques of constructing delay tolerant TAST code for distributed cooperative networks, which, like their brethren codes, are delay tolerant for any delay profile and achieve full diversity for arbitrary number of relays, transmit/receive antennas, and input alphabet size. Our proposed codes with minimum lengths achieve better performances than the existing codes retaining full rate and full diversity with or without use of guard bands. Simulations results confirm our claim of obtaining better performances.